Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
نویسندگان
چکیده
There are exact and heuristic algorithms for solving the MKP. Solution quality and time complexity are two main differences among exact and heuristic algorithms. Solution quality is a measure of how close we are from the optimal point and time complexity is a measure of the required time to reach such point. The purpose of this paper is to report the solution quality obtained from the evaluation of three heuristic approaches presented elsewhere in the literature and to report the solution quality obtained from the evaluation of modified versions of those approaches. A genetic algorithm and an ant system are two of the heuristic evaluated. Key-Words: Knapsack problem, Ant System, Genetic Algorithm.
منابع مشابه
Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model
This research addresses sourcing decisions and how those decisions can affect the management of a company's assets. The study begins with a single-plant problem, in which one facility chooses, from a list of parts, which parts to bring in-house. The selection is based on maximizing the value of the selected parts, while remaining within the plant's capacity. This problem is defined as the insou...
متن کاملHybrid Particle Swarm Algorithm for Solving Multidimensional Knapsack Problem
In order to effectively solve combinatorial optimization problems, the Estimation of Distribution Algorithm (EDA) and Particle Swarm Optimization (PSO) combine to form a new ED-PSO hybrid algorithm, the algorithm can effectively apply global statistical information and global optimal solution to the solution space search. This algorithm is used to solve the Multidimensional Knapsack Problem (MK...
متن کاملNeural metaheuristics for the multidimensional knapsack problem
The multidimensional knapsack problem (MKP) belongs to a very important class of integer optimization problems. In this study, we propose, develop and test metaheuristics based on the neural-networks paradigm for solving the MKP. We show how domain-specific knowledge can be incorporated within the neural-network framework for solving this NP-Hard problem. We provide a mathematical formulation o...
متن کاملAn Exact Cooperative Method for Solving the 0-1 Multidimensional Knapsack Problem
This article presents an exact cooperative method for solving the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. The first step of our algorithm tries to find out a good feasible solution of the (MKP ) using surrogate relaxation. For this purpose, we have developed a modified dynamic programming algorithm. The second step is based on a branch a...
متن کاملA Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem
The 0-1 multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with several real-life applications, for example, in project selection. Genetic algorithms (GA) are effective heuristics for solving the 0-1 MKP. Multiple individual GAs with specific characteristics have been proposed in literature. However, so far, these approaches have only been partially compa...
متن کامل